Adaptive Token Allocation Algorithm For Enhancing The Fairness Among Long Live TCP Flows In Diffserv
نویسندگان
چکیده
In this paper, an attempt has been made to design an algorithm that provides optimal allocation of tokens to the individual long live TCP flows in Differentiated Services (DiffServ) networks. The optimality in token allocation is achieved using an optimization technique that employs Genetic Algorithm (GA). The trial performance of the proposed algorithm has been evaluated through C++ simulation. It has been observed from the simulation studies that the token allocation varies with respect to the incoming rate of the flows. The formulation of the objective function and the application of GA for the optimization process have been explained. The simulation results pertaining to the token allocation for two different cases are also furnished.
منابع مشابه
A Fair Traffic Conditioner for the Assured Service in a Differentiated Services Internet
A research issue under investigation in the context of differentiated services (DiffServ) is the fair distribution of bandwidth between aggregates sharing the same Assured Forwarding (AF) class. Multiplexing both responsive and unresponsive flows, e.g. TCP and UDP respectively, leads to unfair sharing of the available bandwidth in over-provisioned networks. To date, much effort has concentrated...
متن کاملAdaptive token bucket algorithm for fair bandwidth allocation in DiffServ networks
We propose an adaptive token bucket algorithm for achieving proportional sharing of bandwidth among aggregate flows in differentiated service (DiffServ) networks. By observing the simulation results obtained in a study of the throughput of TCP flows in a DiffServ network, we note that the aggregate flow with a lower target rate occupies more bandwidth than its fair share, while the aggregate fl...
متن کاملA New Token Allocation Algorithm for TCP Traffic in DiffServ Network
A new algorithm has been designed for providing optimal allocation of tokens for TCP traffic in DiffServ networks, which is aimed at minimizing the packet losses of the individual flows. The optimality in token allocation is achieved using optimization technique employing Genetic Algorithm (GA). The transient performance of the proposed algorithm has been evaluated through Matlab simulation. It...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملA novel proposal to improve fairness in TCP Reno
The fairness in TCP Reno has been long known as unsatisfactory as it gives more bandwidth shares to short flows while starves the long flows. In this paper, a new proposal to improve fairness in TCP Reno is presented. We describe the bandwidth allocation among TCP Reno flows into a new utility optimised problem, in which the requirement of fairness among flows is taken into account in the const...
متن کامل